Lattice model for approximate self-affine soil profiles

نویسندگان
چکیده

منابع مشابه

Lattice Model for Approximate Self-Affine Soil Profiles

A modeling of the soil structure and surface roughness by means of the concepts of the fractal growth is presented. Two parameters are used to control the model: the fragmentation dimension, Df , and the maximum mass of the deposited aggregates, Mmax. The fragmentation dimension is related to the particle size distribution through the relation N(r ≥ R) ∼ Rf , where N(r ≥ R) is the accumulative ...

متن کامل

Fast algorithm for generating long self-affine profiles.

We introduce a fast algorithm for generating long self-affine profiles. The algorithm, which is based on the fast wavelet transform, is faster than the conventional Fourier filtering algorithm. In addition to increased performance for large systems, the algorithm, named the wavelet filtering algorithm, a priori gives rise to profiles for which the long-range correlation extends throughout the e...

متن کامل

Integral Self Affine Tiles in R Ii Lattice Tilings

Let A be an expanding n n integer matrix with j det A j m A standard digit set D for A is any complete set of coset representatives for Z A Z Associated to a given D is a set T A D which is the attractor of an a ne iterated function system satisfying T d D T d It is known that T A D tiles R n by some subset of Z This paper proves that every standard digit set D gives a set T A D which tiles R w...

متن کامل

Neighbours of Self–Affine Tiles in Lattice Tilings

Let T be a tile of a self-affine lattice tiling. We give an algorithm that allows to determine all neighbours of T in the tiling. This can be used to characterize the sets VL of points, where T meets L other tiles. Our algorithm generalizes an algorithm of the authors which was applicable only to a special class of self-affine lattice tilings. This new algorithm can also be applied to classes c...

متن کامل

INTEGRAL SELF-AFFINE TILES IN Rn II. LATTICE TILINGS

Let A be an expanding n n integer matrix with j det(A)j = m. A standard digit set D for A is any complete set of coset representatives for Z n =A(Z n). Associated to a given D is a set T(A; D), which is the attractor of an aane iterated function system, satisfying T = d2D (T + d). It is known that T(A; D) tiles R n by some subset of Z n. This paper proves that every standard digit set D gives a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physica A: Statistical Mechanics and its Applications

سال: 2001

ISSN: 0378-4371

DOI: 10.1016/s0378-4371(01)00053-x